An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis

SUMMARY This paper describes an optimal scheduling approach which nds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-deened search space is constructed incremen-tally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space eeectively. This method is extended to support multi-cycling operations, operation chaining, pipelined functional units, and pipelined data paths. Experimental results on some benchmarks show the eeciency of the proposed approach.